Today we learned:
- The Priority Queue ADT and why it's useful for managing prioritized tasks.
- The heap data structure is the perfect implementation for a Priority Queue.
- How to represent a heap in an array and perform core operations like `insert` and `extractMax`.
- The efficiency of heapify (\(O(n)\)) and other key operations (\(O(\log n)\)).
Priority Queue ADT
Heap Implementation
Array Representation & Operations
Time Complexity: \(O(n)\) & \(O(\log n)\)